﻿/**
 * MOTOR 2 - RAPID FLASH DYNAMICS
 * Copyright (c) 2007-2008, Michael Baczynski
 * Based on the Box2D Engine by Erin Catto, http://www.box2d.org
 * 
 * All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without modification,
 * are permitted provided that the following conditions are met:
 * 
 * * Redistributions of source code must retain the above copyright notice,
 *   this list of conditions and the following disclaimer.
 * * Redistributions in binary form must reproduce the above copyright notice,
 *   this list of conditions and the following disclaimer in the documentation
 *   and/or other materials provided with the distribution.
 * * Neither the name of the polygonal nor the names of its contributors may be
 *   used to endorse or promote products derived from this software without specific
 *   prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
package de.polygonal.motor2.collision.nbody
{
	public class Pair
	{
		public static const PAIR_BUFFERED:int  = 1 << 1;
		public static const PAIR_RECEIVED:int  = 1 << 2;
		public static const PAIR_REMOVED:int   = 1 << 3;
		
		public static const MAX_PROXIES:int    = 1 << 10;
		public static const MAX_PAIRS:int      = MAX_PROXIES << 3;
		public static const NULL_PAIR:int      = 1 << 16;
		public static const NULL_PROXY:int     = 1 << 16;
		
		public static const TABLE_CAPACITY:int = MAX_PAIRS;
		public static const TABLE_MASK:int     = TABLE_CAPACITY - 1;
		
		public var status:int;
		public var proxyId1:int;
		public var proxyId2:int;
		public var userData:*;
		
		public function Pair(proxyId1:int = 0, proxyId2:int = 0, userData:* = null):void
		{
			if (proxyId1 > proxyId2)
			{
				this.proxyId1 = proxyId2;
				this.proxyId2 = proxyId1;
			}
			else
			{
				this.proxyId1 = proxyId1;
				this.proxyId2 = proxyId2;
			}
			this.userData = userData;
		}
		
		public function init(proxyId1:int, proxyId2:int, userData:*):void
		{
			if (proxyId1 > proxyId2)
			{
				this.proxyId1 = proxyId2;
				this.proxyId2 = proxyId1;
			}
			else
			{
				this.proxyId1 = proxyId1;
				this.proxyId2 = proxyId2;
			}
			this.userData = userData;
		}
		
		public function setBuffered():void   { status |= PAIR_BUFFERED;  }
		public function clearBuffered():void { status &= ~PAIR_BUFFERED; }
		public function isBuffered():Boolean { return (status & PAIR_BUFFERED) == PAIR_BUFFERED; }
		
		public function setRemoved():void   { status |= PAIR_REMOVED; }
		public function clearRemoved():void { status &= ~PAIR_REMOVED; }
		public function isRemoved():Boolean { return (status & PAIR_REMOVED) == PAIR_REMOVED; }
		
		public function setReceived():void { status |= PAIR_RECEIVED; }
		public function isReceived():Boolean { return (status & PAIR_RECEIVED) == PAIR_RECEIVED; }
	}
}